Poisson Distribution Based Initialization for Fuzzy Clustering
نویسندگان
چکیده
A quality of centroid-based clustering is highly dependent on initialization. In the article we propose initialization based on the probability of finding objects, which could represent individual clusters. We present results of experiments which compare the quality of clustering obtained by k-means algorithm and by selected methods for fuzzy clustering: FCM (fuzzy c-means), PCA (possibilistic clustering algorithm) and UPFC (unsupervised possibilistic fuzzy clustering) with different initializations. These experiments demonstrate an improvement in the quality of clustering when initialized by the proposed method. The concept how to estimate a ratio of added noise is also presented.
منابع مشابه
New Technique for Initialization of Centres in TSK Clustering-Based Fuzzy Systems
Several methodologies for function approximation using TSK systems make use of clustering techniques to place the rules in the input space. Nevertheless classical clustering algorithms are more related to unsupervised learning and thus the output of the training data is not taken into account or, simply the characteristics of the function approximation problem are not considered. In this paper ...
متن کاملAn Improved Initialization Method For Fuzzy C-Means Clustering Using Density Based Approach For Microarray Data
An improved initialization method for fuzzy cmeans (FCM) method is proposed which aims at solving the two important issues of clustering performance affected by initial cluster centers and number of clusters. A density based approach is needed to identify the closeness of the data points and to extract cluster center. DBSCAN approach defines ε–neighborhood of a point to determine the core objec...
متن کاملAn Adaptive Aco-based Fuzzy Clustering Algorithm for Noisy Image Segmentation
The fuzzy c-means (FCM) has been a well-known algorithm in machine learning/data mining area as a clustering algorithm. It can also be used for image segmentation, but the algorithm is not robust to noise. The possibilistic c-means (PCM) algorithm was proposed to overcome such a problem. However, the performance of PCM is too sensitive to the initialization of cluster centers, and often deterio...
متن کاملAn Improved Type-2 Possibilistic Fuzzy C-Means Clustering Algorithm with Application for MR Image Segmentation
This paper presents a new clustering algorithm named improved type-2 possibilistic fuzzy c-means (IT2PFCM) for fuzzy segmentation of magnetic resonance imaging, which combines the advantages of type 2 fuzzy set, the fuzzy c-means (FCM) and Possibilistic fuzzy c-means clustering (PFCM). First of all, the type 2 fuzzy is used to fuse the membership function of the two segmentation algorithms (FCM...
متن کاملFuzzy Relatives of the CLARANS Algorithm With Application to Text Clustering
This paper introduces new algorithms (Fuzzy relative of the CLARANS algorithm FCLARANS and Fuzzy c Medoids based on randomized search FCMRANS) for fuzzy clustering of relational data. Unlike existing fuzzy c-medoids algorithm (FCMdd) in which the within cluster dissimilarity of each cluster is minimized in each iteration by recomputing new medoids given current memberships, FCLARANS minimizes t...
متن کامل